Resource-bounded measure on probabilistic classes
نویسندگان
چکیده
منابع مشابه
Resource-bounded measure on probabilistic classes
We extend Lutz’s resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. Unlike former attempts, our resource bounded measure notions satisfy all three basic measure properties, that is every singleton {L} has measure zero, the whole space has measure one, and “enumerable infinite unions” of mea...
متن کاملResource-Bounded Measure
A general theory of resource-bounded measurability and measure is developed. Starting from any feasible probability measure ν on the Cantor space C (the set of all decision problems) and any suitable complexity class C ⊆ C, the theory identifies the subsets of C that are ν-measurable in C and assigns measures to these sets, thereby endowing C with internal measure-theoretic structure. Classes C...
متن کاملOn pseudorandomness and resource-bounded measure
In this paper we extend a key result of Nisan and Wigderson NW94] to the nondeterministic setting: for all > 0 we show that if there is a language in E = DTIME(2 O(n)) that is hard to approximate by nondeterministic circuits of size 2 n , then there is a pseudorandom generator that can be used to derandomize BP NP (in symbols, BP NP = NP). By applying this extension we are able to answer some o...
متن کاملTwo Results on Resource-Bounded Measure
We construct an oracle relative to which NP has p-measure 0 but D p has measure 1 in EXP. This gives a strong relativized negative answer to a question posed by Lutz Lut96]. Secondly, we give strong evidence that BPP is small. We show that BPP has p-measure 0 unless EXP = MA and the polynomial-time hierarchy collapses. This contrasts the work of Regan et al. RSC95], where it is shown that P=pol...
متن کاملResource-bounded measure and autoreducibility
We prove that the following classes have resource-bounded measure zero: the class of self-reducible sets. the class of commitable sets. the class of sets that are non-adaptively autoreducible with a linear number of queries. the class of disjunctively autoreducible sets. 2
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2008
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2007.11.019